Data Security in Fault Tolerant Hard Real Time Systems- Use of Time Dependant Multiple Random Cipher Code

The present research problem is to study the existing encryption methods and to develop a new technique which is performance wise superior to other existing techniques and at the same time can be very well incorporated in the communication channels of Fault Tolerant Hard Real time systems along with existing Error Checking / Error Correcting codes, so that the intention of eaves dropping can be defeated. There are many encryption methods available now. Each method has got it's own merits and demerits. Similarly, many crypt analysis techniques which adversaries use are also available.

A single all-optical processor for multiple spectral amplitude code label recognition using four wave mixing

We propose a novel label processor which can recognize multiple spectral-amplitude-code labels using four-wave-mixing sidebands and selective optical filtering. Ten code-labels x 10 Gbps variable-length packets are transmitted over a 200 km single-hop switched network.

Concentration and time dependant behavior of chlorpromazine interaction with supported bilayer lipid membrane

The interaction of chlorpromazine (CPZ) with supported bilaver lipid (dipalmitoyphosphatidylcholine) membrane (s-BLM) on the glassy carbon electrode (GCE) was investigated using cyclic voltammetry and ac impedance spectroscopy. The experimental data, based on the voltammetric response of Ru(NH3)(6)(3+) associated with the oxidation of CPZ on the electrode, indicated that the interaction of CPZ with s-BLM was concentration and time dependant. The interaction between them could be divided into three stages by the concentration of CPZ: low, middle and high concentration. At the first stage, s-BLM was not affected by CPZ and the interaction was only a penetration of a small quantity of CPZ molecule into s-BLM. At the second stage, the defects formed in s-BLM due to the penetration of more CPZ molecule into s-BLM. At the last stage, a high CPZ:lipid ratio reached in s-BLM, resulting in the solubilization of s-BLM. The interaction time had different effect at three stages.

Parametric accelerated failure time models with random effects and an application to kidney transplant survival

Accelerated failure time models with a shared random component are described, and are used to evaluate the effect of explanatory factors and different transplant centres on survival times following kidney transplantation. Different combinations of the distribution of the random effects and baseline hazard function are considered and the fit of such models to the transplant data is critically assessed. A mixture model that combines short- and long-term components of a hazard function is then developed, which provides a more flexible model for the hazard function. The model can incorporate different explanatory variables and random effects in each component. The model is straightforward to fit using standard statistical software, and is shown to be a good fit to the transplant data. Copyright (C) 2004 John Wiley Sons, Ltd.

Generating multiple random exams using mathematica package and LATEX

<p>[EN]In the framework of the European Higher Education Area, the assessment has been one of the most important aspects considered. In the Spanish Universities, one of the main differences with regard to the previous system is the incorporation of the continuous assessment to the evaluation process that is understood in several ways depending on the Universities, the courses and the lecturers. Focus on our context, a course of Mathematics of the first academic year in the Faculty of Business Administration at the University of Las Palmas de Gran Canaria (Spain), the continuous assessment has brought the preparation of a large amount of different tests to evaluate the students enrolled in it, therefore the incorporation of new tools and skills in order to make the teaching&ndash;learning process easier and more dynamic has become a need mainly in those degrees with a large number of students as the case we consider here. In this work we provide an efficient and effective way to elaborate random multiple-choice examina tion tests (although essay exams are also possible) by using Mathematica package and LATEXin order to make easier to the lectures the preparation of a large number of mid-term tests for a large number of students. </p>

16 chip, 18 Gchips/s walsh-code implementation of an ECDMA access network using two time-shifted FIR filters

We demonstrate for the first time an electronically processed Walsh Code with 16 chips at 18Gchip/s. An auto-cross correlation ratio of 18.1dB is achieved between two orthogonal codes after transmission over 10km of SMF. © 2009 OSA.

On Two-User Gaussian Multiple Access Channels With Finite Input Constellations

Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Multiple Access schemes (NO-MA) and Orthogonal Multiple Access schemes (O-MA). For NO-MA schemes, a metric is proposed to compute the angle(s) of rotation between the input constellations such that the CC capacity regions are maximally enlarged. Further, code pairs based on Trellis Coded Modulation (TCM) are designed with PSK constellation pairs and PAM constellation pairs such that any rate pair within the CC capacity region can be approached. Such a NO-MA scheme which employs CC capacity approaching trellis codes is referred to as Trellis Coded Multiple Access (TCMA). Then, CC capacity regions of O-MA schemes such as Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) are also computed and it is shown that, unlike the Gaussian distributed continuous constellations case, the CC capacity regions with FDMA are strictly contained inside the CC capacity regions with TCMA. Hence, for finite constellations, a NO-MA scheme such as TCMA is better than FDMA and TDMA which makes NO-MA schemes worth pursuing in practice for two-user GMAC. Then, the idea of introducing rotations between the input constellations is used to construct Space-Time Block Code (STBC) pairs for two-user Multiple-Input Single-Output (MISO) fading MAC. The proposed STBCs are shown to have reduced Maximum Likelihood (ML) decoding complexity and information-losslessness property. Finally, STBC pairs with reduced sphere decoding complexity are proposed for two-user Multiple-Input Multiple-Output (MIMO) fading MAC.